Balanced Truncation Model Reduction for a Class of Descriptor Systems with Application to the Oseen Equations
نویسندگان
چکیده
We discuss the computation of balanced truncation model reduction for a class of descriptor systems which include the semidiscrete Oseen equations with time-independent advection and the linearized Navier–Stokes equations, linearized around a steady state. The purpose of this paper is twofold. First, we show how to apply standard balanced truncation model reduction techniques, which apply to dynamical systems given by ordinary differential equations, to this class of descriptor systems. This is accomplished by eliminating the algebraic equation using a projection. The second objective of this paper is to demonstrate how the important class of ADI/Smith-type methods for the approximate computation of reduced order models using balanced truncation can be applied without explicitly computing the aforementioned projection. Instead, we utilize the solution of saddle point problems. We demonstrate the effectiveness of the technique in the computation of reduced order models for semidiscrete Oseen equations.
منابع مشابه
Balanced Truncation Model Reduction for Semidiscretized Stokes Equation
We discuss model reduction of linear continuous-time descriptor systems that arise in the control of semidiscretized Stokes equations. Balanced truncation model reduction methods for descriptor systems are presented. These methods are closely related to the proper and improper controllability and observability Gramians and Hankel singular values of descriptor systems. The Gramians can be comput...
متن کاملOn Model Reduction for Periodic Descriptor Systems Using Balanced Truncation
Linear periodic descriptor systems represent a broad class of time evolutionary processes in micro-electronics and circuit simulation in particular. In this paper we consider discrete-time linear periodic descriptor systems and study the concepts of periodic reachability and observability of the systems based on earlier ideas of Chu et al. [1]. We define reachability and observability Gramians ...
متن کاملLow-rank iterative methods of periodic projected Lyapunov equations and their application in model reduction of periodic descriptor systems
Low-rank iterative methods of periodic projected Lyapunov equations and their application in model reduction of periodic descriptor systems Low-rank iterative methods of periodic projected Lyapunov equations and their application in model reduction of periodic descriptor systems Abstract We discuss the numerical solution of large-scale sparse projected discrete-time periodic Lyapunov equations ...
متن کاملModel Reduction of Periodic Descriptor Systems Using Balanced Truncation
Linear periodic descriptor systems represent a broad class of time evolutionary processes in micro-electronics and circuit simulation. In this paper, we consider discrete-time linear periodic descriptor systems and study the concepts of periodic reachability and observability Gramians. We also discuss a lifted representation of periodic descriptor systems and propose a balanced truncation model...
متن کاملGramian-Based Model Reduction for Descriptor Systems
Model reduction is of fundamental importance in many control applications. We consider model reduction methods for linear time-invariant continuous-time descriptor systems. These methods are based on the balanced truncation technique and closely related to the controllability and observability Gramians and Hankel singular values of descriptor systems. The Gramians can be computed by solving gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 30 شماره
صفحات -
تاریخ انتشار 2008